import java.util.Stack;

public class text90 {
    public static void fenu(int []arr)
    {
        int left=0;
        int right=arr.length-1;
        fen(arr,left,right);
    }
    public static void fen(int[]arr,int left,int right)
    {
        if(left==right)
        {
            return ;
        }
        int mid=(left+right)/2;
        fen(arr,left,mid);
        fen(arr,mid+1,right);
        paixu(arr,left,mid,right);
    }
    public static void paixu(int[]arr,int left,int mid,int right)
    {
        int[]arr2=new int[right-left+1];
        int i=left;
        int j=mid+1;
        int k=0;
        while(i<=mid&&j<=right)
        {
            if(arr[i]<=arr[j])
            {
                arr2[k++]=arr[i++];
            }
            else
            {
                arr2[k++]=arr[j++];
            }
        }
        while(i<=mid)
        {
            arr2[k++]=arr[i++];
        }
        while(j<=right)
        {
            arr2[k++]=arr[j++];
        }
        for(i=0;i<k;i++)
        {
            arr[i+left]=arr2[i];
        }


    }
    public static void fei(int[]arr)
    {
        Stack<Integer>stack=new Stack<>();
        int left=0;
        int right=arr.length-1;
        int mid=find(arr,left,right);
        if(left<mid-1)
        {
            stack.push(left);
            stack.push(mid-1);

        }
        if(mid<right-1)
        {
            stack.push(mid+1);
            stack.push(right);
        }
        while(!stack.isEmpty())
        {
             right=stack.pop();
             left=stack.pop();
            mid=find(arr,left,right);
            if(left<mid-1)
            {
                stack.push(left);
                stack.push(mid-1);

            }
            if(mid<right-1)
            {
                stack.push(mid+1);
                stack.push(right);
            }
        }
    }
    public static int find(int[]arr,int left,int right)
    {
        int tmp=arr[left];
        int i=left;
        while(left<right)
        {
            while(left<right&&arr[right]>=tmp)
            {
                right--;
            }
            while(left<right&&arr[left]<=tmp)
            {
                left++;
            }
            swop(arr,left,right);

        }
        swop(arr,left,i);
        return left;

    }
    public static void swop(int[]arr,int left,int right)
    {
        int tmp=arr[left];
        arr[left]=arr[right];
        arr[right]=tmp;
    }
    public static void count(int[]arr)
    {
        int i=0;
        int min=arr[0];
        int max=arr[0];
        for(i=1;i<arr.length;i++)
        {
            if(arr[i]<min)
            {
                min=arr[i];
            }
            if(arr[i]>max)
            {
                max=arr[i];
            }

        }
        int size=max-min+1;
        int[]arr2=new int[size];
        for(i=0;i<arr.length;i++)
        {
            arr2[arr[i]-min]++;
        }
        for(i=0;i<size;i++)
        {
            while(arr2[i]>=1)
            {

                System.out.print(i+min+" ");
                arr2[i]--;
            }


        }


    }









    public static void main(String[] args) {
        //System.out.println(1);
        int[]arr={90,93,90,91,91,94,93};
        //count(arr);
        //fei(arr);
        fenu(arr);
        System.out.println(1);
    }
}
